Low contention semaphores and ready lists

Monitors and Semaphores

Efficient Low-Contention Parallel Algorithms

The queue-read queue-write asyn-chronous PRAM model. Parallel algorithms for shared-memory machines. The design and analysis of a new hybrid sorting algorithm. A new universal class of hash functions and dynamic hashing in real time. NYU Ultracomputer { designing an MIMD shared memory parallel computer. In this paper we have presented highly parallel work-optimal algorithms for several fundamen...

Distributed, low contention task allocation

Designing a good task allocation algorithm faces the challenge of allowing high levels of throughput, so that tasks are executed fast and processor parallelism is exploited, while still guaranteeing a low level of memory contention, so that performance does not su er because of limitations on processor-to-memory bandwidth. In this work, we present a comparative study of throughput and contentio...

Strengthen, Widen, Get Semaphores

Many parallel programs are expressed in terms of conditional atomic actions with different degrees of atomicity. It is known that these synchronization primitives are expensive to implement in its fully generality [2]. Many platforms provide an efficient set of synchronization primitives. Semaphores are a very special case of conditional atomic actions which can be considered a canonical synchr...

Process Scheduling and UNIX Semaphores

Semaphores have been used extensively in programming concurrent tasks. Various extensions have been proposed for problems in which traditional semaphores turned out to be difficult to use. The extended semaphore primitives investigated here are based on the version of semaphores implemented in UNIX System V. Implementation issues are discussed and practical illustrations of their use are provid...